Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Binary probability segmentation of video based on graphics processing unit
LI Jinjing, CHEN Qingkui, LIU Baoping, LIU Bocheng
Journal of Computer Applications    2015, 35 (11): 3187-3193.   DOI: 10.11772/j.issn.1001-9081.2015.11.3187
Abstract427)      PDF (1079KB)(426)       Save
Since the segmentation performance of existing binary segmentation algorithm for video is excessively low, a binary probability segmentation algorithm in real-time based on Graphics Processing Unit (GPU) was proposed. The algorithm implemented a probabilistic segmentation based on the Quadratic Markov Measure Field (QMMF) model by regularizing the likelihood of each pixel of frame belonging to forground class or background class. In this algorithm, first two kinds of likelihood models, Static Background Likelihood Model (SBLM) and Unstable Background Likelihood Model (UBLM) were proposed. Secondly, the probability of each pixel belonging to background was computed by tonal transforming, cast shadow detecting and camouflage detecting algorithm. Finally, the probability of background which makes the energy function have a minimum value was computed by Gauss-Seidel model iteration and the binary value of each pixel was calculated. Moreover, illumination change, cast shadow and camouflage were included to improve the accuracy of segmentation algorithm. In order to fulfill the real-time requirement, a parallel version of our algorithm was implemented in a NVIDIA GPU. The accuracy and GPU execution time of the segmentation algorithm were analyzed. The experimental results show that the average missing rate and false detection rate of ViBe+ and GMM+ are 3 and 6 times those of QMMF, the average execution time of GPU of ViBe+ and GMM+ is about 1.3 times that of QMMF. Moreover, the average speedup of algorithm was computed and it is about 76.8.
Reference | Related Articles | Metrics
Parallelization of deformable part model algorithm based on graphics processing unit
LIU Baoping, CHEN Qingkui, LI Jinjing, LIU Bocheng
Journal of Computer Applications    2015, 35 (11): 3075-3078.   DOI: 10.11772/j.issn.1001-9081.2015.11.3075
Abstract612)      PDF (832KB)(494)       Save
At present, in the field of target recognition, the highest accuracy algorithm is the Deformable Part Model (DPM) for human detection. Aiming at the disadvantage of large amount of calculation, a parallel solution method based on Graphics Processing Unit (GPU) was proposed. In this paper, with the GPU programming model of OpenCL, the details of the whole DPM algorithm were implemented by the parallel methods,and optimization of the memory model and threads allocation was made. Through the comparison of the OpenCV library and the GPU implementation, under the premise of ensuring the detection effect, the execution efficiency of the algorithm was increased by nearly 8 times.
Reference | Related Articles | Metrics